Computability theory - PDFSEARCH.IO - Document Search Engine

Computability theory
Results: 1231

#	Item
151	NONCOMPUTABLE CONDITIONAL DISTRIBUTIONS NATHANAEL L. ACKERMAN, CAMERON E. FREER, AND DANIEL M. ROY Abstract. We study the computability of conditional probability, a fundamental notion in probability theory and Bayesian Add to Reading List Source URL: danroy.org Language: English - Date: 2011-06-10 23:48:01
152	T HE HIERARCHIES M ATHIAS - LIKE FORCING Controlling iterated jumps of Ramsey-type theorems Add to Reading List Source URL: ludovicpatey.com Language: English - Date: 2015-09-20 15:03:06 Computability theory Low
153	Analyzing proofs in analysis∗ Ulrich Kohlenbach Fachbereich Mathematik, J.W.Goethe–Universit¨at Robert–Mayer–Str. 6–10, D–60054 Frankfurt am Main, Germany 1 Add to Reading List Source URL: www.mathematik.tu-darmstadt.de Language: English - Date: 2012-11-16 10:10:27 Logic Mathematics Mathematical analysis Automated theorem proving Logic programming Logical truth Propositional calculus Substitution Computability theory operator Spectral theory of ordinary differential equations
154	Topics in the Theory and Practice of Computable Analysis Branimir Lambov PhD Dissertation Add to Reading List Source URL: www.mathematik.tu-darmstadt.de Language: English - Date: 2006-06-09 09:40:53 Computability theory Theory of computation Computable number Computable analysis Mathematical analysis Mathematical logic Function Computable function Hypercomputation
155	Π01 ENCODABILITY AND OMNISCIENT REDUCTIONS BENOIT MONIN AND LUDOVIC PATEY Abstract. A set of integers A is computably encodable if every infinite set of integers has an infinite subset computing A. By a result of Solova Add to Reading List Source URL: ludovicpatey.com Language: English - Date: 2016-03-08 13:28:28 Computability theory 01 class Riemann surfaces Probability theory Measure theory Differential forms on a Riemann surface Modulus of continuity
156	ON THE LOGICAL STRENGTHS OF PARTIAL SOLUTIONS TO MATHEMATICAL PROBLEMS LAURENT BIENVENU, LUDOVIC PATEY, AND PAUL SHAFER ABSTRACT. We use the framework of reverse mathematics to address the question of, given a mathematic Add to Reading List Source URL: ludovicpatey.com Language: English - Date: 2015-08-13 12:44:18 Computability theory Logic Proof theory Mathematics Mathematical logic Reverse mathematics Model theory Philosophy of mathematics Symbol Fixed-point theorems Primitive recursive functional Generalised Whitehead product
157	CURRICULUM VITAE DAMIR D. DZHAFAROV Contact Department of Mathematics University of Connecticut Add to Reading List Source URL: www.math.uconn.edu Language: English - Date: 2016-05-15 18:54:00 Computability theory Mathematical logic High Computability
158	Computability Theory, Reverse Mathematics, and Ordered Fields Oscar Louis Levin, Ph.D. University of Connecticut, 2009 Add to Reading List Source URL: www.math.uconn.edu Language: English - Date: 2009-04-27 16:38:49 Field theory Computability theory Real algebraic geometry Theory of computation Elementary mathematics Ordered field Computable function Field Archimedean property Function Real number Reverse mathematics
159	U NIVERSITÉ PARIS D IDEROT – PARIS VII S ORBONNE PARIS C ITÉ É COLE D OCTORALE S CIENCES M ATHÉMATIQUES DE PARIS C ENTRE THÈSE en vue d’obtenir le grade de Add to Reading List Source URL: ludovicpatey.com Language: English - Date: 2016-02-09 12:07:59 Computability theory Ramsey theory Theorem Graph coloring Reverse mathematics
160	Reverse Mathematics and a Weak Ramsey-Type K¨onig’s Lemma Ludovic Patey Laurent Bienvenu Add to Reading List Source URL: ludovicpatey.com Language: English - Date: 2013-04-16 05:41:23 Mathematics Logic Mathematical logic Proof theory Abstraction Computability theory Reverse mathematics Second-order arithmetic Theorem Lemma

UPDATE